Refinement and state machine abstraction
نویسندگان
چکیده
منابع مشابه
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
ion-Refinement 1. Generate an initial abstraction function h. 2. Build abstract machine M̂ based on h. Model check M̂ . If M̂ |= φ, then M |= φ. Return TRUE. 3. If M̂ 6|= φ, check the counterexample on the concrete model. If the counterexample is real, M 6|= φ. Return FALSE. 4. Refine h, and go to step 2. SAT based Abstraction-Refinement using ILP and Machine Learning Techniques 13 Abstraction Func...
متن کاملPredicate Abstraction and Refinement for Model Checking VHDL State Machines
In this paper we present an automatic combination of abstraction-refinement by which we translate a VHDL model describing a state system to an initial equivalent abstract system described by SMV to explore its state space to verify CTL properties. We present the method implemented to compute automatically abstractions using decision procedures. This method can handle different kinds of infinite...
متن کاملOn Abstraction in Finite State Machine Models
Information hiding is a long established principle in software engineering. However, in the context of finite state machines a contrary principle of information exposure has been suggested. Using a simple example, we examine why a proven abstraction mechanism which works well in other areas may be less successful when applied to a finite state machine model. After using Statecharts [3] to speci...
متن کاملAbstraction Refinement for Trace Inclusion of Infinite State Systems
ion Refinement and Antichains for Trace Inclusion of Infinite State Systems Radu Iosif, Adam Rogalewicz, and Tomáš Vojnar CNRS/Verimag, France and FIT BUT, Czech Republic Abstract. A data automaton is a finite automaton equipped with variables (counA data automaton is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automat...
متن کاملFinite State Machine Testing from an or State Refinement Design
The paper formalizes the OR refinement of finite state machines and develops an efficient method to integrate the test sets of the component machines in order to test the flattened machine. The approach supports componentsoftware development since it constructs test sets for an assembly of systems from readily available test sets of the prefabricated parts.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00169-9